Minimum-cost matching in a random bipartite graph with random costs
نویسندگان
چکیده
Let G = Gn,n,p be the random bipartite graph on n+n vertices, where each e ∈ [n] appears as an edge independently with probability p. Suppose that each edge e is given an independent uniform exponential rate one cost. Let C(G) denote the expected length of the minimum cost perfect matching. We show that w.h.p. if d = np (log n) then E [C(G)] = (1 + o(1)) 2 6p . This generalises the well-known result for the case G = Kn,n.
منابع مشابه
Minimum-cost matching in a regular bipartite graph with random costs
Let G be an arbitrary d-regular bipartite graph on 2N vertices. Suppose that each edge e is given an independent uniform exponential rate one cost. Let C(G) denote the expected length of the minimum cost perfect matching. We show that if d = d(N) → ∞ as N → ∞, then E [C(G)] = (1 + o(1))Nd π 6 . This generalises the well-known result for the case G = KN,N .
متن کاملMinimum Cost Matching in a Random Graph with Random Costs
Let Gn,p be the standard Erdős-Rényi-Gilbert random graph and let Gn,n,p be the random bipartite graph on n + n vertices, where each e ∈ [n] appears as an edge independently with probability p. For a graph G = (V,E), suppose that each edge e ∈ E is given an independent uniform exponential rate one cost. Let C(G) denote the random variable equal to the length of the minimum cost perfect matching...
متن کاملA Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
We study the Online Minimum Metric Bipartite Matching Problem. In this problem, we are given point sets S and R which correspond to the server and request locations; here |S| = |R| = n. All these locations are points from some metric space and the cost of matching a server to a request is given by the distance between their locations in this space. In this problem, the request points arrive one...
متن کاملAverage-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the Vickrey cost of a minimum spanning tree (MST) in a complete graph with random edge weights; and the Vickrey cost of a perfect matching in a complete bipartite graph with random edge weights. In each case, in the large-size...
متن کاملRandom polymatroid flow problems
We generalize the so-called random assignment problem to a setting where we impose a polymatroid structure on the two vertex-sets of a complete bipartite graph, and ask for an edge set of prescribed size connecting independent sets. As an application, we show that under independent exponential edge-costs, the cost of the cheapest edge set covering all vertices of an n by n bipartite graph is as...
متن کامل